Dalang - A Re ective Java Extension

نویسندگان

  • Ian Welch
  • Robert Stroud
چکیده

Dalang is a re ective extension for standard Java. It extends the re ective API to include behavioural re ection as well as introspection. It di ers from some other re ective Java implementations in that it requires no change, either to the Java Virtual Machine or the Java system classes. We outline the implementation of Dalang Java, evaluate it, describe our approach to addressing problems with the current implementation and conclude with some open questions that require further research.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

LEAD + + : An Object - Oriented Re ective Language forDynamically Adaptable

A system has dynamic adaptability if it can adapt itself to dynamically changing runtime environments. As open-ended distributed systems and mobile computing systems have spread widely, the need for software with dynamic adaptability increases. We propose a model of software with dynamic adaptability and the object-oriented re-ective language LEAD++ based on the model. The basic idea is that we...

متن کامل

Towards a Theory of Re ective Programming Languages (

This paper attempts to develop a better theoretical understanding of re ective systems. We begin by a developing a re ective extension of the v -calculus and de ne a simple operational semantics for it based on the in nite tower model described in [10]. We then develop an equational logic from this semantics. The resulting logic is shown to be weak because of re ective properties. We establish ...

متن کامل

Speeding up the Meta-level Processing of Java Through Partial Evaluation

Run-time features like re ection in object-oriented languages decrease application performance. In order to reconcile exibility and performance, we adapt the standard partial evaluation process to deal with Java re ection API. This paper present a way to evaluate at compile time the meta-object computations that normally take place at run time. A classi cation of the Java re ective methods allo...

متن کامل

Towards a theory of reflective programming languages

This paper attempts to develop a better theoretical understanding of re ective systems. We begin by a developing a re ective extension of the v-calculus and de ne a simple operational semantics for it based on the in nite tower model described in [10]. We then develop an equational logic from this semantics. The resulting logic is shown to be weak because of re ective properties. We establish p...

متن کامل

Sketch4J: Execution-Driven Sketching for Java

Sketching is a relatively recent approach to program synthesis, which has shown much promise. Œe key idea in sketching is to allow users to write partial programs that have “holes” and provide test harnesses or reference implementations, and let synthesis tools create program fragments that €ll the holes such that the resulting complete program has the desired functionality. Traditional solutio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998